Splicing Representations of Strictly Locally Testable Languages

نویسنده

  • Tom Head
چکیده

The relationship between the family SH of simple splicing languages, which was recently introduced by A. Mateescu and coauthors, and the family SLT of strictly locally testable languages is clariied by establishing an ascending hierarchy of families fSiH : i ?1g of splicing languages for which SH = S1H and the union of the families is the family SLT. A procedure is given which, for an arbitrary regular language L, determines whether L is in SLT and, when L is in SLT, speciies constructively the smallest family in the hierarchy to which L belongs. Examples are given of sets of restriction enzymes for which the action on DNA molecules is naturally represented by splicing systems of the types discussed.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning Concatenations of Locally Testable Languages from Positive Data

This paper introduces the class of concatenations of locally testable languages and its subclasses, and presents some results on the learnability of the classes from positive data. We rst establish several relationships among the language classes introduced, and give a su cient condition for a concatenation operation to preserve nite elasticity of a language class C. Then we show that, for each...

متن کامل

From Regular to Strictly Locally Testable Languages

A classical result (often credited to Y. Medvedev) states that every language recognized by a finite automaton is the homomorphic image of a local language, over a much larger so-called local alphabet, namely the alphabet of the edges of the transition graph. Local languages are characterized by the value k = 2 of the sliding window width in the McNaughton and Papert’s infinite hierarchy of str...

متن کامل

Regular Languages and Associative Language Descriptions

The Associative Language Description model (ALD) is a combination of locally testable and constituent structure ideas. It is consistent with current views on brain organization and can rather conveniently describe typical technical languages such as Pascal or HTML. ALD languages are strictly enclosed in context-free languages but in practice the ALD model equals CF grammars in explanatory adequ...

متن کامل

Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages

A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally threshold testable) separator. In both cases, we design a decision procedure based on the occurrence of special patterns in automata accepting...

متن کامل

On Separation by Locally Testable and Locally Threshold Testable Languages

A separator for two languages is a third language containing the first one and disjoint from the second one. We investigate the following decision problem: given two regular input languages, decide whether there exists a locally testable (resp. a locally threshold testable) separator. In both cases, we design a decision procedure based on the occurrence of special patterns in automata accepting...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Applied Mathematics

دوره 87  شماره 

صفحات  -

تاریخ انتشار 1998